Embedding into the rectilinear grid
نویسندگان
چکیده
We show that the embedding of metric spaces into the l1-grid Z can be characterized in essentially the same fashion as in the case of the l1-plane R . In particular, a metric space can be embedded into Z iff every subspace with at most 6 points is embeddable. Moreover, if such an embedding exists, it can be constructed in polynomial time (for finite spaces) . q 1998 John Wiley & Sons, Inc. Networks 32: 127–132, 1998 The rectilinear metric (alias l1-metric) is probably the for the embedding in the grid Z 2 (‘‘digital plane’’) endowed with the rectilinear distance (alias city block metsimplest distance measure in R n . This explains why in many cases rectilinear spaces are selected as host spaces ric) (see Fig. 1) . Again, as in [1] , we can take advantage of such notions as ‘‘d-split’’ and ‘‘totally decomposable for embedding a given metric space; we refer to Hubert et al. [7] for an application to multidimensional scaling metrics,’’ introduced and investigated in the case of finite metric spaces by Bandelt and Dress [2] . where one aims at producing a visual display of a given data set and to Deza and Laurent [6] for other applicaLet (X , d) be a metric space. We will say that (X , d) satisfies the parity condition if d(u , £) / d(£, w) / d(w , tions. Surprisingly, the problem to characterize the metric subspaces of the rectilinear space of a given dimension u) is an even integer for any u , £, w √ X (cf. [10] for a straightforward metric characterization of bipartite seems to be much more difficult than is the analogous problem for Euclidean spaces, where suitable criteria are graphs) . To every pair S Å {A , B} of nonempty subsets of X we associate the isolation index aS ( if it exists) with given by the classical results of Menger and Schoenberg (see [4]) . However, at least the two-dimensional case respect to d , as follows: can be approached. Recently, by sharpening a result of Malitz and Malitz [8] , we proved the following MengeraS Å 12r min a ,a =√A b ,b =√B (max{d(a , b) / d(a *, b *) , d(a , b *) type theorem for the rectilinear plane R 2 : A metric space is embeddable in the plane if and only if every subspace / d(a *, b) , d(a , a *) / d(b , b *)} with at most 6 points is such [1] . It was the purpose of this paper to demonstrate that the same result holds true 0 d(a , a *) 0 d(b , b *)) . Evidently, if (X , d) satisfies the parity condition, then all Correspondence to: V. Chepoi, SFB343 Diskrete Strukturen in der distances are integers, and, hence, for every pair S Å {A , Mathematik, Universität Bielefeld, D-33615 Bielefeld, Germany. 2 On leave from the Universitatea de stat din Moldova, Chişinǎu B}, the minimum is attained, so that aS ¢ 0 is well q 1998 John Wiley & Sons, Inc. CCC 0028-3045/98/020127-06
منابع مشابه
Embedding into Rectilinear Spaces
We show that the problem whether a given finite metric space (X, d) can be embedded into the rectilinear space R m can be formulated in terms of m-colorability of a certain hypergraph associated with (X, d). This is used to close a gap in the proof of an assertion of Bandelt and Chepoi [2] on certain critical metric spaces for this embedding problem. We also consider the question of determining...
متن کاملRectilinear Graphs and their Embeddings
The embedding problem for a class of graphs called rectilinear graphs is discussed. These graphs have applications in many VLSI Layout Problems. An interesting topological characterization of these graphs lead to efficient algorithms for recognizing and embedding rectilinear graphs which are embeddable on the plane.
متن کاملEmbedding a Graph in the Grid of a Surface with the Minimum Number of Bends is NP-hard
Abs t rac t . This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model for those embeddings and we study the complexity of minimizing the number of bends. In particular, we prove that testing whether a graph admits a rectilinear (without bends) embedding essentially equivalent to a given embedding, and that given a graph, testing if...
متن کاملCombination of Adaptive-Grid Embedding and Redistribution Methods on Semi Structured Grids for two-dimensional invisid flows
Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...
متن کاملEffects of Directional Subdividing on adaptive Grid-Embedding (RESEARCH NOTE)
The effects of using both directions and directional subdividing on adaptive gridembedding on the computational time and the number of grid points required for the same accuracy are considered. Directional subdividing is used from the beginning of the adaptation procedure without any restriction. To avoid the complication of unstructured grid, the semi-structured grid was used. It is used to so...
متن کاملCombination of Adaptive-Grid Embedding and Redistribution Methods on Semi Structured Grids for two-dimensional invisid flows
Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 32 شماره
صفحات -
تاریخ انتشار 1998